Right - linear finite path overlapping rewrite systems effectively preserve recognizability ∗
نویسندگان
چکیده
Right-linear finite path overlapping TRS are shown to effectively preserve recognizability. The class of right-linear finite path overlapping TRS properly includes the class of linear generalized semimonadic TRS and the class of inverse left-linear growing TRS, which are known to effectively preserve recognizability.
منابع مشابه
Left-linear Bounded TRSs are Inverse Recognizability Preserving
Bounded rewriting for linear term rewriting systems has been defined in (I. Durand, G. Sénizergues, M. Sylvestre. Termination of linear bounded term rewriting systems. Proceedings of the 21st International Conference on Rewriting Techniques and Applications) as a restriction of the usual notion of rewriting. We extend here this notion to the whole class of left-linear term rewriting systems, an...
متن کاملBottom-up rewriting for words and terms
For the whole class of linear term rewriting systems, we define bottomup rewriting which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze the complexity of the underlying construction. The BottomUp class (BU) is, by definition, the set of linear systems for which every derivation can be replaced by a bo...
متن کاملConfluence of Layered Rewrite Systems
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal number of non-overlapping redexes along a path from the root to a leaf. Overlappings are allowed in finite or infinite trees. Rules may be non-terminating, non-l...
متن کاملNon - E - overlapping and weakly shallow TRSs are confluent ( Extended abstract ) Masahiko Sakai
Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08]. Two decidable subclasses are known: right-linear and shallow TRSs by tree automata techniques [GT05] and terminating TRSs [KB70]. Most of sufficient conditions are for either terminating TRSs [KB70] (extended to TRSs with relative termination [HA11, KH12]) or leftl...
متن کاملA New Result about the Decidability of the Existential One-Step Rewriting Theory
We give a decision procedure for the whole existential fragment of one-step rewriting rst-order theory, in the case where rewrite systems are linear, non left-left-overlapping (i.e. without critical pairs), and non-left-right-overlapping (i.e. no left-hand-side overlaps on top with the right-hand-side of the same rewrite rule 2). The procedure is deened by means of tree-tuple synchronized gramm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002